Preconditioned Conjugate-Residual Solvers for Helmholtz Equations in Nonhydrostatic Models

نویسندگان

  • WILLIAM C. SKAMAROCK
  • PIOTR K. SMOLARKIEWICZ
  • JOSEPH B. KLEMP
چکیده

Numerical integration of the compressible nonhydrostatic equations using semi-implicit techniques is complicated by the need to solve a Helmholtz equation at each time step. The authors present an accurate and efficient technique for solving the Helmholtz equation using a conjugate-residual (CR) algorithm that is accelerated by ADI preconditioners. These preconditioned CR solvers possess four distinct advantages over most other solvers that have been used with the Helmholtz equations that arise in compressible nonhydrostatic semi-implicit atmospheric models: the preconditioned CR methods 1) can solve Helmholtz equations containing variable coefficients, alleviating the need to prescribe a reference state in order to simplify the elliptic problem; 2) transparently include the cross-derivative terms arising from terrain transformations; 3) are efficient and accurate for nonhydrostatic models used across a broad range of scales, from cloud scales to synoptic-global scales; and 4) are easy to formulate and program. These features of the CR solver allow semi-implicit formulations that are unconstrained by the form of the Helmholtz equations, and the authors propose a formulation that is more consistent than those most often used in that it includes implicit treatment of all terms associated with the pressure gradients and divergence. This formulation is stable for nonhydrostatic-scale simulations involving steep terrain, whereas the more common semi-implicit formulation is not. The ADI preconditioners are presented for use in simulations of both hydrostatic and nonhydrostatic scale flows. These simulations demonstrate the efficiency and accuracy of the preconditioned CR method and the overall stability of the model formulation. The simulations also suggest a general convergence criteria for the iterative algorithm in terms of the solution divergence.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving large systems arising from fractional models by preconditioned methods

This study develops and analyzes preconditioned Krylov subspace methods to solve linear systems arising from discretization of the time-independent space-fractional models. First, we apply shifted Grunwald formulas to obtain a stable finite difference approximation to fractional advection-diffusion equations. Then, we employee two preconditioned iterative methods, namely, the preconditioned gen...

متن کامل

GPU Implementation of Iterative Solvers in Numerical Weather Predicting Models

Numerical weather predicting models often require solving a 3-D Helmholtz problem which derived from the governing equation of dynamical core in Met Office Unified Model, by preconditioned iterative solvers. In this dissertation, a GPU implementation of preconditioned conjugate gradient (CG) iterative method will be focused on. A given serial code has been ported on GPU. According to the portin...

متن کامل

Preconditioned IterativeMethods for Two-Dimensional Space-Fractional Diffusion Equations

In this paper, preconditioned iterative methods for solving two-dimensional space-fractional diffusion equations are considered. The fractional diffusion equation is discretized by a second-order finite difference scheme, namely, the Crank-Nicolson weighted and shifted Grünwald difference (CN-WSGD) scheme proposed in [W. Tian, H. Zhou andW. Deng, A class of second order difference approximation...

متن کامل

Fast solvers with block-diagonal preconditioners for linear FEM-BEM coupling

The purpose of this paper is to present optimal preconditioned iterative methods to solve indefinite linear systems of equations arising from symmetric coupling of finite elements and boundary elements [14]. This is a block-diagonal preconditioner together with a conjugate residual method (PCR) and a preconditioned inner-outer iteration (PIO). We prove the efficiency of these methods by showing...

متن کامل

New variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs

In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997